//
// Created by xili on 2024/9/2 15:49.
// GO BIG OR GO HOME.
//
#include "leetcode.h"

class Solution {
public:
    int minPartitions(string n) {
        int mx = 0;
        for (auto &it: n) {
            mx = max(mx, it - '0');
        }
        return mx;
    }
};